A New Translation from ECTL* to SAT
نویسنده
چکیده
In this paper we present a new translation from ECTL∗ to SAT and show that the proposed translation substantially increases the efficiency of verifying temporal properties using the Bounded Model Checking method. We have implemented our new translation and made experimental results, which demonstrate the efficiency of the method. keywords: ECTL∗, translation to SAT, Bounded Model Checking
منابع مشابه
Improving the Translation from ECTL to SAT
The objective of this paper is to offer an improvement to the translation from ECTL to SAT introduced in [7] and show that the improvement proposed substantially increases the efficiency of verifying temporal properties using the Bounded Model Checking method. keywords: ECTL, Bounded Model Checking, translation to SAT
متن کاملA Comparison of SAT-Based and SMT-Based Bounded Model Checking Methods for ECTL
In this paper we present a comparison of the SAT-based bounded model checking (BMC) and SMT-based bounded model checking methods for ECTL properties of a parallel composition of transition systems. In the both methods we use the parallel composition (of the transition systems) based on the interleaved semantics. Moreover, the both methods use the same bounded semantics of ECTL formulae, the com...
متن کاملBounded Model Checking Approaches for Verification of Distributed Time Petri Nets
We consider two symbolic approaches to bounded model checking (BMC) of distributed time Petri nets (DTPNs). We focus on the properties expressed in Linear Temporal Logic without the neXt-time operator (LTL−X) and the existential fragment of Computation Tree Logic without the neXt-time operator (ECTL−X). We give a translation of BMC to SAT and describe a BDD-based BMC for both LTL−X and ECTL−X. ...
متن کاملOn Boolean Encodings of Transition Relation for Parallel Compositions of Transition Systems
We present and compare different Boolean encodings of the transition relation for the parallel composition of transition systems, both for the asynchronous and the synchronous semantics. We compare the encodings considered by applying them to the SAT-based bounded model checking (BMC) of ECTL∗ properties. We provide experimental results which show that our new encoding for the asynchronous sema...
متن کاملSatisfiability of ECTL* with Tree Constraints
Recently, we have shown that satisfiability for ECTL∗ with constraints over Z is decidable using a new technique. This approach reduces the satisfiability problem of ECTL∗ with constraints over some structure A (or class of structures) to the problem whether A has a certain model theoretic property that we called EHD (for “existence of homomorphisms is decidable”). Here we apply this approach t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 120 شماره
صفحات -
تاریخ انتشار 2012